State-Machine Replication with Infinitely Many Processes

نویسندگان

  • Gregory Cho
  • Danny Dolev
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimistic Generic Broadcast

We consider an asynchronous system with the Ω failure detector, and investigate the number of communication steps required by various broadcast protocols in runs in which the leader does not change. Atomic Broadcast, used for example in state machine replication, requires three communication steps. Optimistic Atomic Broadcast requires only two steps if all correct processes receive messages in ...

متن کامل

Infinitely many solutions for a bi-nonlocal‎ ‎equation with sign-changing weight functions

In this paper, we investigate the existence of infinitely many solutions for a bi-nonlocal equation with sign-changing weight functions. We use some natural constraints and the Ljusternik-Schnirelman critical point theory on C1-manifolds, to prove our main results.

متن کامل

Introduction to Transactional Replication

Transactional replication is a new enabling technology for service replication. Service replication means that a service runs on a group of processes (service replicas) that work together to execute requests issued by external clients. The characteristic feature of transactional replication is that client requests can be processed on a single replica concurrently as atomic transactions that can...

متن کامل

Generalized Universality

State machine replication reduces distributed to centralized computing. Any sequential service, modeled by a state machine, can be replicated over any number of processes and made highly available to all of them. At the heart of this fundamental reduction lies the so called universal consensus abstraction, key to providing the illusion of single shared service, despite replication. Yet, as univ...

متن کامل

Brief Announcement: Multicoordinated Paxos∗

In the consensus problem, processes must agree on a single value, given a set of proposals. It is used, for example, to implement statemachine replication [4], in which failure-independent processors are replicated to implement a reliable service. In this approach, the states of the replicas are consistently changed by applying deterministic commands from a sequence, each one agreed upon using ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002